Hoeffding Decompositions and Two-Colour Urn Sequences

نویسندگان

  • Omar EL-DAKKAK
  • Giovanni PECCATI
چکیده

Let X = (X1, X2, ...) be a non-deterministic infinite exchangeable sequence with values in {0, 1}. We show that X is Hoeffding-decomposable if, and only if, X is either an i.i.d. sequence or a Pólya sequence. This completes the results established in Peccati [2004]. The proof uses several combinatorial implications of the correspondence between Hoeffding decomposability and weak independence. Our results must be compared with previous characterizations of i.i.d. and Pólya sequences given by Hill et al. [1987] and Diaconis and Yilvisaker [1979] .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exchangeable Hoeffding decompositions over finite sets: A combinatorial characterization and counterexamples

We study Hoeffding decomposable exchangeable sequences with values in a finite set D = {d1, . . . , dK}. We provide a new combinatorial characterization of Hoeffding decomposability and use this result to show that, for every K ≥ 3, there exists a class of neither Pólya nor i.i.d. D-valued exchangeable sequences that are Hoeffding decomposable.

متن کامل

Hoeffding-anova Decompositions for Symmetric Statistics of Exchangeable Observations

Consider a (possibly infinite) exchangeable sequence X= {Xn : 1≤ n < N}, where N ∈ N ∪ {∞}, with values in a Borel space (A,A), and note Xn = (X1, . . . ,Xn). We say that X is Hoeffding decomposable if, for each n, every square integrable, centered and symmetric statistic based on Xn can be written as an orthogonal sum of n U statistics with degenerated and symmetric kernels of increasing order...

متن کامل

Martingale Couplings and Bounds on Tails of Probability Distributions

Wassily Hoeffding, in his 1963 paper, introduces a procedure to derive inequalities between distributions. This method relies on finding a martingale coupling between the two random variables. I have developed a construction that establishes such couplings in various urn models. I use this construction to prove the inequality between the hypergeometric and binomial random variables that appears...

متن کامل

A note on the rechargeable Polya urn scheme

A very simple specific case of a Polya urn scheme is as follows. At each trial one draws a ball from an urn with balls of two different colours. Then, one looks at the ball, and returns the ball to the urn together with another ball of the same colour. Then one makes another draw. Et cetera. At the first draw there is one ball of each colour. The rechargeable Polya urn scheme is essentially the...

متن کامل

Analytic Combinatorics of the Mabinogion Urn

The Mabinogion urn is a simple model of the spread of influences amongst versatile populations. It corresponds to a non-standard urn with balls of two colours: each time a ball is drawn, it causes a ball of the other kind to switch its colour. The process stops once unanimity has been reached. This note provides analytic expressions describing the evolution of the Mabinogion urn, based on a tim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006